the l(2,1)-choosability of cycle
نویسندگان
چکیده
for a given graph $g=(v,e)$, let $mathscr l(g)={l(v) : vin v}$ be a prescribed list assignment. $g$ is $mathscr l$-$l(2,1)$-colorable if there exists a vertex labeling $f$ of $g$ such that $f(v)in l(v)$ for all $v in v$; $|f(u)-f(v)|geq 2$ if $d_g(u,v) = 1$; and $|f(u)-f(v)|geq 1$ if $d_g(u,v)=2$. if $g$ is $mathscr l$-$l(2,1)$-colorable for every list assignment $mathscr l$ with $|l(v)|geq k$ for all $vin v$, then $g$ is said to be $k$-$l(2,1)$-choosable. in this paper, we prove all cycles are $5$-$l(2,1)$-choosable.
منابع مشابه
Choosability of a weighted path and free-choosability of a cycle
A graph G with a list of colors L(v) and weight w(v) for each vertex v is (L,w)-colorable if one can choose a subset of w(v) colors from L(v) for each vertex v, such that adjacent vertices receive disjoint color sets. In this paper, we give necessary and sufficient conditions for a weighted path to be (L,w)-colorable for some list assignments L. Furthermore, we solve the problem of the free-cho...
متن کاملChoosability, Edge Choosability, and Total Choosability of Outerplane Graphs
Let χl (G), χ ′ l (G), χ ′′ l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. (1) 2 ≤ χl (G) ≤ 3 and χl (G) = 2 if and only if G is bipartite with at most one cycle. (2) 1(G) ≤ χ ′ l (G) ≤ 1(G) + 1 and χ ′ l (G) = 1(G) + ...
متن کاملThe adaptable choosability number grows with the choosability number
The adaptable choosability number of a multigraph G, denoted cha(G), is the smallest integer k such that every edge labeling of G and assignment of lists of size k to the vertices of G permits a list coloring of G in which no edge e = uv has both u and v colored with the label of e. We show that cha grows with ch, i.e. there is a function f tending to infinity such that cha(G) ≥ f(ch(G)).
متن کاملChoosability and edge choosability of planar graphs without five cycles
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)h c oosable. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Choosability, Edge choosability, Degeneracy, Planar graph.
متن کاملCircular choosability
We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that cch(G) = O (ch(G) + ln |V (G)|) for every graph G. We investigate a generalisation of circular choosability, the circular f -choosability, where f is a function of the degrees. We also consider the circular choice n...
متن کاملMatrix Choosability
Let F be a finite field with pc elements, let A be a n×n matrix over F , and let k be a positive integer. When is it true that for all X1, . . . , Xn ⊆ F with |Xi| = k+1 and for all Y1, . . . , Yn ⊆ F with |Yi| = k, there exist x ∈ X1×. . .×Xn and y ∈ (F \Y1)×. . .×(F \Yn) such that Ax = y? It is trivial that A has this property for k = pc − 1 if det(A) 6= 0. The permanent lemma of Noga Alon pr...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsناشر: university of isfahan
ISSN 2251-8657
دوره 1
شماره 3 2012
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023